In this thesis we want to compare two process calculi: CSP and CCS. We limit CSP to a specific syntax and substitute the parallel operator. We also extend CCS by name-passing. The aim is to find an encoding from CSP in CCS that is stronger then the, in [Gla12] presented, encoding up-to trace-equivalence. Still they remain uncomparable in the end due to our modifications. We give the encoding and proofs for some essential criteria from [Gor08] in two steps. We first concentrate on a small part of the CSP syntax to then add the rest of the syntax. In the end we explain some remaining problems and ideas for solutions.